Bounding the Partition Function of Spin-Systems
نویسندگان
چکیده
منابع مشابه
Bounding the Partition Function of Spin-Systems
With a graph G = (V,E) we associate a collection of non-negative real weights ⋃ v∈V {λi,v : 1 ≤ i ≤ m} ∪ ⋃ uv∈E{λij,uv : 1 ≤ i ≤ j ≤ m}. We consider the probability distribution on {f : V → {1, . . . ,m}} in which each f occurs with probability proportional to ∏ v∈V λf(v),v ∏ uv∈E λf(u)f(v),uv . Many well-known statistical physics models, including the Ising model with an external field and the...
متن کاملBounding the Partition Function using Holder's Inequality
We describe an algorithm for approximate inference in graphical models based on Hölder’s inequality that provides upper and lower bounds on common summation problems such as computing the partition function or probability of evidence in a graphical model. Our algorithm unifies and extends several existing approaches, including variable elimination techniques such as minibucket elimination and v...
متن کاملApproximating the partition function of planar two-state spin systems
We consider the problem of approximating the partition function of the hard-core model on planar graphs of degree at most 4. We show that when the activity λ is sufficiently large, there is no fully polynomial randomised approximation scheme for evaluating the partition function unless NP = RP. The result extends to a nearby region of the parameter space in a more general two-state spin system ...
متن کاملAnytime Anyspace AND/OR Search for Bounding the Partition Function
Bounding the partition function is a key inference task in many graphical models. In this paper, we develop an anytime anyspace search algorithm taking advantage of AND/OR tree structure and optimized variational heuristics to tighten deterministic bounds on the partition function. We study how our priority-driven best-first search scheme can improve on stateof-the-art variational bounds in an ...
متن کاملBounding Iterated Function Systems via Convex Optimization
We present an algorithm to construct a bounding polyhedron for an affine Iterated Function System (IFS). Our algorithm expresses the IFS-bounding problem as a set of linear constraints on a linear objective function, which can then be solved via standard techniques for linear convex optimization. As such, our algorithm is guaranteed to find the optimum recursively instantiable bounding volume, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2006
ISSN: 1077-8926
DOI: 10.37236/1098